Solving Practical Railway Crew Scheduling Problems with Attendance Rates

Arising from a practical problem in German rail passenger transport, a prototype for a multi-period railway crew scheduling problem with attendance rates for conductors is developed and evaluated in this paper. The consideration of attendance rates is of increasing importance in regional transport networks and requires decision support. For this purpose business analytics is applied in order to offer an approach to transform real-world data to concrete operational decision support (action). The focus here is on the analysis step using a new set covering model with several essential restrictions integrated for the first time. A hybrid column generation approach is applied, which solves the pricing problem by means of a genetic algorithm. The artifact is evaluated with the help of a case study of three real-world transport networks. It is shown that the hybrid solution approach is able to solve the problem more effectively and efficiently compared to conventional approaches used in practice

An efficient column generation approach for practical railway crew scheduling with attendance rates

The crew scheduling problem with attendance rates is highly relevant for regional passenger rail transport in Germany. Its major characteristic is that only a certain percentage of trains have to be covered by crew members or conductors, causing a significant increase in complexity. Despite being commonly found in regional transport networks, discussions regarding this issue remain relatively rare in the literature. We propose a novel hybrid column generation approach for a real-world problem in railway passenger transport. To the best of our knowledge, several realistic requirements that are necessary for successful application of generated schedules in practice have been integrated for the first time in this study. A mixed integer programming model is used to solve the master problem, whereas a genetic algorithm is applied for the pricing problem. Several improvement strategies are applied to accelerate the solution process; these strategies are analyzed in detail and are exemplified. The effectiveness of the proposed algorithm is proven by a comprehensive computational study using real-world instances, which are made publicly available. Further we provide real optimality gaps on average less than 10 % based on lower bounds generated by solving an arc flow formulation. The developed approach is successfully used in practice by DB Regio AG